geometric combinatorics

См. также в других словарях:

• Combinatorics — is a branch of mathematics concerning the study of finite or countable discrete structures. Aspects of combinatorics include counting the structures of a given kind and size (enumerative combinatorics), deciding when certain criteria can be met,… …   Wikipedia

• combinatorics — /keuhm buy neuh tawr iks, tor , kom beuh /, n. (used with singular v.) See combinatorial analysis. * * * Branch of mathematics concerned with the selection, arrangement, and combination of objects chosen from a finite set. The number of possible… …   Universalium

• Outline of combinatorics — See also: Index of combinatorics articles The following outline is presented as an overview of and topical guide to combinatorics: Combinatorics – branch of mathematics concerning the study of finite or countable discrete structures. Contents 1… …   Wikipedia

• Arithmetic combinatorics — arose out of the interplay between number theory, combinatorics, ergodic theory and harmonic analysis. It is about combinatorial estimates associated with arithmetic operations (addition, subtraction, multiplication, and division). Additive… …   Wikipedia

• Small set (combinatorics) — In combinatorial mathematics, a small set of positive integers:S = {s 0,s 1,s 2,s 3,dots}is one such that the infinite sum:frac{1}{s 0}+frac{1}{s 1}+frac{1}{s 2}+frac{1}{s 3}+cdots converges. A large set is any other set of positive integers (i.e …   Wikipedia

• Marcel-Paul Schützenberger — Born October 24, 1920(1920 10 24) Paris Died July 29, 1996(1996 07 29) (aged 75) …   Wikipedia

• Combinatoire — Pour les articles homonymes, voir combinatoire (homonymie). Une planche de l encyclopédie de Diderot et d Alembert illustrant l article « Carreleur » …   Wikipédia en Français

• Poset topology — In mathematics, the poset topology associated with a partially ordered set S (or poset for short) is the Alexandrov topology (open sets are upper sets) on the poset of finite chains of S, ordered by inclusion. Let V be a set of vertices. An… …   Wikipedia

• Cluster algebra — Cluster algebras are a class of commutative rings introduced by Fomin and Zelevinsky (2002, 2003, 2007). A cluster algebra of rank n is an integral domain A, together with some subsets of size n called clusters whose union generates the… …   Wikipedia

• List of theorems — This is a list of theorems, by Wikipedia page. See also *list of fundamental theorems *list of lemmas *list of conjectures *list of inequalities *list of mathematical proofs *list of misnamed theorems *Existence theorem *Classification of finite… …   Wikipedia

• number game — Introduction       any of various puzzles and games that involve aspects of mathematics.       Mathematical recreations comprise puzzles and games that vary from naive amusements to sophisticated problems, some of which have never been solved.… …   Universalium